Intensional logics without interative axioms
نویسنده
چکیده
It may be that there is no way to axiomatize an intensional logic without recourse to one or more iterative axioms; then I call that logic iterative. But many familiar logics can be axiomatized by means of non-iterative axioms alone; these logics I call non-iterative. A frame, roughly speaking, is a partial interpretation for an intensional language. It provides a set 1, all subsets of which are to be regarded as eligible propositional values or truth sets for formulas. It also provides, for each intensional operator in the language, a function specifying how the propositional values of formulas compounded by means of that operator are to depend on the propositional values of their immediate constituents. A frame plus an assignment of values to propositional variables are enough to yield an assignment of propositional values to all formulas in the language. Iff every interpretation based on a certain frame assigns the propositional value 1 (truth everywhere) to a certain formula, then we say that the formula is valid in the frame. There are two different natural ways in which an intensional logic L may be said to ‘correspond’ to a class C of frames. For any class C of frames, there is a logic L that has as its theorems exactly those formulas that are valid in all frames in the class C. We say then that the class C
منابع مشابه
Canonicity for Intensional Logics Without Iterative Axioms
DAVID LEWIS proved in 1974 that all logics without iterative axioms are weakly complete. In this paper we extend LEWIS’s ideas and provide a proof that such logics are canonical and so strongly complete. This paper also discusses the differences between relational and neighborhood frame semantics and poses a number of open questions about the latter. Canonicity for Intensional Logics Without It...
متن کاملCanonicity for Intensional Logics with Even Axioms
This paper looks at the concept of neighborhood canonicity introduced by BRIAN CHELLAS [2]. We follow the lead of the author’s paper [8] where it was shown that every non-iterative logic is neighborhood canonical and here we will show that all logics whose axioms have a simple syntactic form—no intensional operator is in boolean combination with a propositional letter—and which have the finite ...
متن کاملNegative consistent axioms can be postulated without loss of canonicity
We show that, in intensional Martin-Löf type theory, negative consistent axioms can be postulated so that every closed term of natural number type reduces to a numeral. We also sketch some applications.
متن کاملConceptual Knowledge Representation and Reasoning
One of the main areas in knowledge representation and logic-based artificial intelligence concerns logical formalisms that can be used for representing and reasoning with concepts. For almost 30 years, since research in this area began, the issue of intensionality has had a special status in that it has been considered to play an important role, yet it has not been precisely established what it...
متن کاملOn truth-schemes for intensional logics
In this paper we present a certain conception of truth for intensional logics. This conception is a natural generalization of the well-known relational semantics for intensional systems. It is based on some ideas set forth by Suszko and Wójcicki in the seventies. Let S = (S, f1, f2, ...) be a sentential language, i.e., S is an absolutely free algebra generated by an infinite set of sentential v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Philosophical Logic
دوره 3 شماره
صفحات -
تاریخ انتشار 1974